MLP Neural Networks Optimization through Simulated Annealing in a Hybrid Approach for Time Series Prediction
نویسندگان
چکیده
This paper proposes a new hybrid approach which combines simulated annealing and standard backpropagation for optimizing Multi Layer Perceptron Neural Networks for time series prediction. Experimental results have shown that this approach selects the appropriate time series lags and builds an MLP with adequate number of hidden neurons required for achieving good performance on the task. The performance attained was better than some results recently reported for hybrid systems combining Genetic Algorithms (GA) and MLPs for the same purpose presented here.
منابع مشابه
Hybrid Approach for Time Series Prediction using Neural Networks and Simulated Annealing
This paper proposes a new hybrid approach which combines simulated annealing and standard backpropagation for optimizing Multi Layer Perceptron Neural Networks (MLP) for time series prediction. Experimental tests were carried out on four simulated series with known features and on the Sunspot series. The results have shown that this approach selects the appropriate time series lags and builds a...
متن کاملPrediction of Gain in LD-CELP Using Hybrid Genetic/PSO-Neural Models
In this paper, the gain in LD-CELP speech coding algorithm is predicted using three neural models, that are equipped by genetic and particle swarm optimization (PSO) algorithms to optimize the structure and parameters of neural networks. Elman, multi-layer perceptron (MLP) and fuzzy ARTMAP are the candidate neural models. The optimized number of nodes in the first and second hidden layers of El...
متن کاملPrediction of Gain in LD-CELP Using Hybrid Genetic/PSO-Neural Models
In this paper, the gain in LD-CELP speech coding algorithm is predicted using three neural models, that are equipped by genetic and particle swarm optimization (PSO) algorithms to optimize the structure and parameters of neural networks. Elman, multi-layer perceptron (MLP) and fuzzy ARTMAP are the candidate neural models. The optimized number of nodes in the first and second hidden layers of El...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملA New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005